منابع مشابه
The faintest accretors
Recent X–ray observations have detected a class of very faint X–ray transients in the Galaxy which probably reveal a previously unrecognised type of accretion on to neutron stars or black holes. We show that these systems cannot have descended from binaries with stellar–mass components of normal composition. Accretion of hydrogen– depleted matter on to stellar–mass black holes can account for i...
متن کاملDetection of a New "chemical" Boundary at Comet Halley
Plasma observations near comet Halley indicate that around 1.6x105km from the nucleus a newly discovered sharp boundary (cometopause) separates the solar wind controlled external and the heavy cometary ion dominated internal regions. Such a discontinuity was previously not predicted by theoretical models. Inside the cometopause (in the cometary plasma region) the protons and heavy ions move wit...
متن کاملThe faintest speck of dirt: disgust enhances the detection of impurity.
Purity is commonly regarded as being physically embodied in the color white, with even trivial deviations from whiteness indicating a loss of purity. In three studies, we explored the implications of this "white = pure" association for disgust, an emotion that motivates the detection and avoidance of impurities that threaten purity and cleanliness. We hypothesized that disgust tunes perception ...
متن کاملJets from the faintest black holes
The question whether quiescent black hole X-ray binaries are capable of powering relativistic outflows is addressed by means of simultaneous radio/X-ray observations of a nearby system steadily emitting X-rays below 10−8 times the Eddington luminosity. The robust detection of a radio counterpart suggests that a synchrotron emitting outflow is being powered by this system, even though its degree...
متن کاملFarthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log n) time algorithm to compute it. We also prove a number of structural properties of this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eos, Transactions American Geophysical Union
سال: 2003
ISSN: 0096-3941
DOI: 10.1029/2003eo370006